//测试——优先队列
#ifndef __TESTPRIORITYQUEUE__CPP
#define __TESTPRIORITYQUEUE__CPP

#include<iostream>
#include<cstdlib>
#include<ctime>
#include"../../DataStructure/Queue/PriorityQueue.hpp"

using namespace std;
using namespace NgSiuKei;

int main(void) {
    srand(time(0));
    
    cout << "初始化" << endl;
    PriorityQueue<int> queue;
    queue.print();

    const int size = 10;
    int val;
    for(int i=0; i<size; ++i) {
        val = rand()%(size*10)+1;
        cout << "插入：" << val << endl;
        queue.push(val);
        queue.print();
    }

    queue.clear();
    queue.print();

    return 0;
}

#endif